#include "graph.h"
#include "Dijkstra.h"
#include <iostream>
#include <cstdlib>

int main(int argc, char* argv[]){
  Graph<int> G;
  G.set_point(5);
  G.append_side(1,2,10);
  G.append_side(1,3,3);
  G.append_side(2,3,1);
  G.append_side(3,2,4);
  G.append_side(2,4,2);
  G.append_side(3,4,8);
  G.append_side(3,5,2);
  G.append_side(4,5,7);
  G.append_side(5,4,9);
  int* S = new int(6);
  BinaryTree<int>* path;
  S = Dijkstra_all(G,1,path);
  for (int i=1; i<6 ; i++)
  std::cout << S[i] << " ";
  std::cout << std::endl;
  std::cout << Dijkstra(G,1,4) << std::endl;
  std::cout << Dijkstra(G,3,4) << std::endl;
}
